Exhaustive enumeration unveils clustering and freezing in random 3-SAT
نویسندگان
چکیده
We study geometrical properties of the complete set of solutions of the random 3-satisfiability problem. We show that even for moderate system sizes the number of clusters corresponds surprisingly well with the theoretic asymptotic prediction. We locate the freezing transition in the space of solutions which has been conjectured to be relevant in explaining the onset of computational hardness in random constraint satisfaction problems.
منابع مشابه
Frozen variables in random boolean constraint satisfaction problems
We determine the exact freezing threshold, r , for a family of models of random boolean constraint satisfaction problems, including NAE-SAT and hypergraph 2-colouring, when the constraint size is sufficiently large. If the constraint-density of a random CSP, F , in our family is greater than r then for almost every solution of F , a linear number of variables are frozen, meaning that their colo...
متن کاملAspects of Statistical Physics in Computational Complexity
The aim of this review paper is to give a panoramic of the impact of spin glass theory and statistical physics in the study of the K-sat problem, as summarised by the words of Amin Coja-Oghlan ([2], Warwick 2010) ”Random K-sat is a spin glass problem (with a combinatorial flavor)”. The introduction of spin glass theory in the study of the random K-sat problem has had profound effects on the fie...
متن کاملAn Investigation of the Effect of Freezing on Strength and Durability of Dimension Stones Using Fuzzy Clustering Technique and Statistical Analysis
Western and North-Western regions of Iran feature very cold winters, a lot of snow, and freezing temperatures during most nights in December, January, February, and March. This directly influences the selection and applications of dimension stones in these areas. Freezing influences both mechanical and physical properties of rocks. Therefore, measuring the changes in values of these parameters ...
متن کاملDesign of parallel portfolios for SAT-based solving of Hamiltonian cycle problems
We study portfolios of parallel strategies for Boolean Satisfiability (SAT) based solving of Hamiltonian Cycle Problems (HCPs). The strategies are based on our techniques for relative SAT encoding of permutations with constraints, and exploit: 1) encodings that eliminate half of the ordering Boolean variables and two-thirds of the transitivity constraints; 2) 12 triangulation heuristics for min...
متن کاملExact algorithms for solving a bi-level location–allocation problem considering customer preferences
The issue discussed in this paper is a bi-level problem in which two rivals compete in attracting customers and maximizing their profits which means that competitors competing for market share must compete in the centers that are going to be located in the near future. In this paper, a nonlinear model presented in the literature considering customer preferences is linearized. Customer behavior ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0804.0362 شماره
صفحات -
تاریخ انتشار 2008